Non-approximability of the Bulk Synchronous Task Scheduling Problem
نویسندگان
چکیده
The mainstream architecture of a parallel machine with more than tens of processors is a distributed-memory machine. The bulk synchronous task scheduling problem (BSSP, for short) is an task scheduling problem for distributed-memory machines. This paper shows that there does not exist a ρ-approximation algorithm to solve the optimization counterpart of BSSP for any ρ < 6 5 unless P = NP .
منابع مشابه
NP-Completeness of the Bulk Synchronous Task Scheduling Problem and Its Approximation Algorithm
The bulk synchronous task scheduling problem (BSSP) is known as an effective task scheduling problem for distributed-memory machines, but the time complexity of BSSP is unknown. This paper presents a proof of NPcompleteness of BSSP even in the case of unit time tasks and positive integer constant communication delays. This paper also gives an approximation algorithm for BSSP in several restrict...
متن کاملIntegrated modeling and solving the resource allocation problem and task scheduling in the cloud computing environment
Cloud computing is considered to be a new service provider technology for users and businesses. However, the cloud environment is facing a number of challenges. Resource allocation in a way that is optimum for users and cloud providers is difficult because of lack of data sharing between them. On the other hand, job scheduling is a basic issue and at the same time a big challenge in reaching hi...
متن کاملAn Effective Task Scheduling Framework for Cloud Computing using NSGA-II
Cloud computing is a model for convenient on-demand user’s access to changeable and configurable computing resources such as networks, servers, storage, applications, and services with minimal management of resources and service provider interaction. Task scheduling is regarded as a fundamental issue in cloud computing which aims at distributing the load on the different resources of a distribu...
متن کاملOn the Performance Gap between a Task Schedule and its Corresponding Parallel Program
Consider a task scheduling problem of a given fine grained task graph on distributed-memory parallel machines. In this paper, we report that schedules with small makespan generated by existing task scheduling algorithms do not usually become fast parallel programs on distributed-memory parallel machines. That is caused by no consideration to message packaging. To obtain fast parallel programs u...
متن کاملThe Loading Time Scheduling Problem 1
In this paper we study precedence constrained scheduling problems, where the tasks can only be executed on a speci ed subset of the machines. Each machine has a loading time that is incurred only for the rst task that is scheduled on the machine in a particular run. This basic scheduling problem arises in the context of machining on numerically controlled machines, query optimization in databas...
متن کامل